منابع مشابه
Compatibility of subsystem states and convex geometry
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the ideas of convexity that have been successfully employed against the separability problem. Analogously to an entanglement witness, we introduce the idea of a comp...
متن کاملSubsystem pseudopure states
A critical step in experimental quantum information processing QIP is to implement control of quantum systems protected against decoherence via informational encodings, such as quantum error-correcting codes, noiseless subsystems, and decoherence-free subspaces. These encodings lead to the promise of fault-tolerant QIP, but they come at the expense of resource overheads. Part of the challenge i...
متن کاملElectromagnetic Compatibility Analysis for the Railway Telecommunication Intra-subsystem
This paper presents the electromagnetic interference and electromagnetic susceptibility characteristics of the railway telecommunication intra-subsystem. These are for assessing the electromagnetic compatibility inside the railway telecommunication subsystem and providing input data for electromagnetic compatibility analysis of other subsystems (intra-system analysis). This paper shows the opti...
متن کاملSIC-POVMs and Compatibility among Quantum States
An unexpected connection exists between compatibility criteria for quantum states and Symmetric Informationally Complete quantum measurements (SIC-POVMs). Beginning with Caves, Fuchs and Schack’s "Conditions for compatibility of quantum state assignments", I show that a qutrit SIC-POVM studied in other contexts enjoys additional interesting properties. Compatibility criteria provide a new way t...
متن کاملOn a conjecture of compatibility of multi-states characters
Perfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete [5, 30]. We propose in this article a conjecture on the necessary and sufficient conditions of compatibility: Given a set C of r-states full characters, there exists a function f(r) such that C is compatible iff every set of f(r) characters of C is compatible. According to [8, 10, 9, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Physics
سال: 2006
ISSN: 0015-9018,1572-9516
DOI: 10.1007/s10701-005-9006-z